Method and arrangement for measuring holding time in communication networks

ABSTRACT

The present invention relates to a method for measuring holding time in a communication network. Using traffic volume and call attempt number measurements from earlier measurement intervals as well as the current interval makes it possible to calculate the holding time parameters of the calls generated during the current interval in a much more accurate way. The method can be incorporated into performance management systems or any other systems or tools post-processing measurement results from network elements. As examples three practical implementations are described.

[0001] The present invention relates to measurements of holding time in communication networks, for use in tools for management and planning of the network.

BACKGROUND

[0002] Traffic volume, call attempt number and holding time measurements are the basic measurements performed in telecommunication networks. These parameters provide the operators with invaluable information about the network status.

[0003] These measurements form the basis of capacity planning and element dimensioning of these networks.

[0004] Measurement methods and systems used today were designed for networks carrying predominantly voice traffic. In today's networks the characteristics of the traffic have changed to that extent that some of the preconditions assumed has became obsolete. As a result of this some measurement results are incorrect. This poses a big problem because statistics based on these misleading results are used as basis for decisions about the future investments into the networks and operation and maintenance issues.

STATE OF THE ART

[0005] The above mentioned key parameters are measured in network elements using event counters. The measurements are performed in fixed time intervals. However there are performance parameters, which are not easy to measure directly.

[0006] One of these parameters is the holding time. Network elements today provide measurement results of the average holding time during the measurement interval, but in fact this value is calculated from the traffic and call attempt counter values for the given interval.

[0007] Another way to get these statistics is to process data in the charging databases. Some operators use traffic statistics from these databases, but this solution has several shortcomings. Data stored in the charging database are confidential and strategically sensitive. Also the processing of these large amounts of data is expensive and can not be performed continuously to have up to date statistics on a minute or even daily basis.

PROBLEM

[0008] As it was mentioned previously the holding time parameter is calculated based on the traffic and call attempt counters. Basically the following formula is used:

H_(i)=A_(i)/I_(i)

[0009] where:

[0010] H_(i): is the holding time

[0011] A_(i): is the traffic

[0012] I_(i): is the call intensity (number of call attempts per time unit)

[0013] i: index of the measurement interval

[0014] For example lets assume a 30 minutes long measurement interval, 180 Erlang's measured by the traffic counter and 3600 call attempts counted during this interval. Based on the above formula this gives us 90 seconds holding time, as the call intensity is 2 calls per second (3600 call attempts divided by the length of the measurement interval).

[0015] In the next example lets assume again 30 minutes long measurement interval and 180 Erlang's traffic measured, but the call attempt counter value now is only 36. The above formula gives us in this case 9000 seconds holding time. How could we measure 9000 seconds holding time in 1800 seconds long measurement interval?

[0016] The problem with this value is that it is calculated based on the traffic and call attempt counters only from one measurement interval. The assumption that the traffic measured during a measurement interval is generated by the call attempts arriving during that interval is invalid. If we assume 36 call attempts generated at the beginning of the measurement interval and calls not terminated before the end of the interval the resulting traffic is 36 Erlang's. This means that 36 call attempts can not generate more traffic than 36 Erlang's during the measurement interval irrespective of the holding time.

[0017] The explanation of the above problem is that large portion of the measured traffic was generated by call attempts from the previous measurement intervals. The above formula is correct if the traffic generating process gets into a quasi stationary state in considerably shorter time than the length of the measurement interval.

[0018] Another practical problem is that in real life the traffic seems to change its characteristics so fast that it can not settle into a stationary state. This means that the above formula can not be used to obtain correct measurement results for example from links carrying traffic towards Internet service providers.

BRIEF SUMMARY OF THE PRESENT INVENTION

[0019] It is an object of the present invention to produce a method and arrangement for measuring holding time in a communication network which avoids the shortcomings of the traditional method. Using traffic volume and call attempt number measurements from earlier measurement intervals as well it is possible to calculate the holding time parameter of the calls generated during the current interval in a much more accurate way.

[0020] While the error of the traditional way of measuring holding time depends not only on the confidence of traffic and call attempt measurements but also on the characteristics of the holding time profile of the users, the method according to the present invention is affected mainly by the confidence of the traffic and call attempt measurements.

[0021] A further object of the invention is to produce a method and arrangement for measuring holding time that cope with fast changing characteristics of the traffic in a communication net.

[0022] Other objects of the invention are to implement the above-described method into performance management systems or any other systems or tools postprocessing measurement results from network elements.

[0023] The objects described above are achieved in a method, arrangement and various fields of use as described in the appended patent claims.

BRIEF DESCRIPTION OF THE DRAWINGS

[0024]FIG. 1 is a schematic flow diagram showing the various steps involved in performing the inventive method.

[0025]FIG. 2 is a chart, which demonstrates some results achieved using the present invention.

[0026]FIG. 3 is a functional chart showing the invention implemented in a general performance management tool.

[0027]FIG. 4 is a chart showing the invention implemented in a network element.

[0028]FIG. 5 shows two different ways of implementing the invention in network planning and design tools.

DETAILED DESCRIPTION OF THE INVENTION

[0029] The invention will now be described in detail in reference to the appended drawings.

[0030]FIG. 1 shows an algorithm for calculation of the holding time, H, in a network according to the present invention.

[0031] The traffic measured during the current interval consists of two components:

{overscore (A _(j))}={overscore (G _(j))}+{overscore (R _(j))}

[0032] where:

[0033] {overscore (A)}_(j): is the traffic measured during the j^(th) interval

[0034] {overscore (G)}_(j): is the traffic generated by call attempts during the j^(th) interval

[0035] {overscore (R)}_(j): is the traffic remaining from earlier intervals

[0036] If we assume that A_(j) ^(s)(t) is the number of circuits occupied by calls which were generated during the j^(th) interval, then: ${\overset{\_}{G}}_{j} = {\frac{1}{T}{\int_{0}^{T}{{A_{j}^{s}(t)}{t}}}}$

[0037] where: T:  is the length of the measurement period ${\overset{\_}{G}}_{j}\text{:}\quad \text{is the traffic generated by call attempts during the}\quad j^{th}\quad \text{interval}$

[0038] is the length of the measurement period

[0039] is the traffic generated by call attempts during the interval

[0040] As it was mentioned beforehand {overscore (G)}_(j) is the average value of the traffic (number of occupied circuits) generated by calls arriving during j^(th) period at the end of the j^(th) period. The value of the traffic level at the end of the j^(th) period is:

G _(j) =A _(j) ^(s)(T)

[0041] The amount of traffic remaining from the previous intervals can be calculated in the following way: ${\overset{\_}{R}}_{j} = {\sum\limits_{i = {j - 1}}^{- \infty}{\overset{\_}{R}}_{i,j}}$

[0042] where {overscore (R)}i,j is the average traffic from the i^(th) interval remaining in the j^(th) interval. It can be calculated in the following way: ${\overset{\_}{R}}_{i,j} = {\frac{1}{T}{\int_{{({j - i - 1})}T}^{{({j - i})}T}{{A_{i}^{e}(t)}{t}}}}$

[0043] where:

[0044] A_(i) ^(e)(t: is the number of occupied circuits by calls generated during the i^(th) interval after the end of the i^(th) interval

[0045] As A_(i) ^(e)(t) and A_(j) ^(s)(t) are functions of holding time and call intensity and {overscore (A)}_(j) and call intensity values are known from measurements the above formulae can be used to obtain the holding time value with a proper mathematical method.

[0046] If we for example assume that the interarrival time and the holding time has exponential distribution then: ${A^{s}{j(x)}} = {I_{j}{H_{j}\left( {1 - ^{- \frac{x}{H_{j}}}} \right)}}$ ${A^{e}{j(x)}} = {G_{j}^{- \frac{x}{H_{j}}}}$

[0047] As a result of this: ${\overset{\_}{A}}_{j} = {{\overset{\_}{G}}_{j} + {\overset{\_}{R}}_{j}}$ ${\overset{\_}{R}}_{j} = {\sum\limits_{i = {j - 1}}^{- \infty}{\overset{\_}{R}}_{i,j}}$ ${\overset{\_}{G}}_{j} = {I_{j}{H_{j}\left( {1 - {\frac{H_{j}}{t}\left( {1 - ^{- \quad \frac{t}{H_{j}}}} \right)}} \right)}}$ ${\overset{\_}{G}}_{j} = {I_{j}{H_{j}\left( {1 - ^{- \quad \frac{t}{H_{j}}}} \right)}}$ ${\overset{\_}{R}}_{i,j} = {G_{i}\frac{H_{i}}{t}\left( {^{- \quad \frac{{({j - i - 1})}t}{H_{i}}} - ^{- \quad \frac{{({j - i})}t}{H_{i}}}} \right)}$ i < j

[0048] We can use iteration to find the value of H_(j). This way it is possible to get much more accurate holding time values than with the traditional method.

[0049] The chart in FIG. 5 demonstrates some results achieved using this method. Traffic profile, call attempt and holding time measurement results were collected from a real network route connecting an ISP to the local exchange. The chart shows the measured traffic profile, the traffic profile regenerated based on the traditional holding time measurement method and the traffic profile based on holding time calculated based on the method described in this document.

[0050] The above-described method could be incorporated into performance management systems or any other systems or tools post-processing measurement results from network elements.

[0051] The input parameters of the module implementing the method are the results of the traffic measurements (traffic [Erlang] and call intensity [calls/sec]) based on the traditional counter-based collection of network statistics. The output of the module is the corrected holding time parameter.

[0052] As examples three practical implementations are described below:

[0053] Network Management—Performance Management Tool

[0054] Network Element—Statistics

[0055] Network Planning and Dimensioning Tool

[0056] A. Network Management—Performance Management Tool

[0057]FIG. 2 contains a simple functional chart describing the general architecture of performance management tools. The NE boxes represents the network elements collecting the network statistics. The results of these measurements are collected into a Traffic Database from where the application processing and displaying the results can access the statistics. The picture also shows the place of the LHT module in this architecture.

[0058] The above implementation of the method provides the users of performance management systems with corrected holding time statistics while the network elements (switches) remain unchanged.

[0059] B Network Element—Statistics

[0060] Another possible implementation is to perform the correction of the statistics at the network element. This implementation allows the interface of the network element to remain unchanged while providing corrected statistics for the other applications polling the network element.

[0061] The method can be implemented as integrated part of the network element's statistical module or it can be an external module attached to the network element.

[0062]FIG. 3 demonstrates these possibilities.

[0063] In the figure NE-A represents a network element containing the integrated implementation of the method and NE-B is a network element having an external device implementing the method and correcting the statistics.

[0064] C. Network Planning and Design Tool

[0065] Besides network management tools network planning applications also make intensive use of statistics collected from network elements. Thus incorporating the method into these tools can provide the users with valuable additional information.

[0066] Similarly to the implementation of the method at network elements the method can be either integrated into these tools or can be implemented as an external module. In the later case the input network statistics should be pre-processed by the LHT module before feeding them to the planning application.

[0067]FIG. 5 demonstrates these concepts:

[0068] The planning tool A is using LHT as an external pre-processing module and planning tool B has an integrated implementation of the method. 

1. Method for measuring holding time in a communications network which includes several network elements, characterised in that the method includes: measuring the traffic volume with first event counters installed in each network element, and which count the number of circuits occupied by calls in a measurement interval. storing said measurement in memory means. repeating said measurement during subsequent intervals. computing the holding time for a given interval from traffic measurements from said interval and the previous intervals and measurements of call intensity obtained from second event counters counting the number of call attempts during said given interval.
 2. Method as claimed in claim 1, characterised in that the holding time, H_(j), for a given interval, j, is calculated from the relationship: H _(j)=({overscore (A _(j))}−{overscore (R _(j))})/I _(j) where {overscore (A_(j))}={overscore (G_(j))}+{overscore (R_(j))} is the average value of the traffic measured during the j^(th) interval, {overscore (G_(j))} is the traffic generated by call attempts during the j^(th) interval, ${\overset{\_}{G_{j} =}\frac{1}{T}{\int_{0}^{T}{{A_{j}^{s}(t)}{t}}}},$

where A_(j) ^(s)(t) is the number of circuits occupied by calls generated during the j^(th) interval, {overscore (R_(j))} is the average value of the traffic remaining from earlier intervals, I_(j) is the call intensity measured as the number of call attempts counted during the j^(th) interval.
 3. Method as claimed in claim 2, characterised in that {overscore (R_(j))} is computed as $\overset{\_}{R_{j}} = {\sum\limits_{i = {j - 1}}^{- \infty}\overset{\_}{R_{i,j}}}$

where {overscore (R_(i,j))} is the average traffic from the i^(th) interval remaining in the j^(th) interval, and $\overset{\_}{R_{i,j}} = {\frac{1}{T}{\int_{{({j - i - 1})}T}^{{({j - i})}T}{{A_{i}^{e}(t)}{t}}}}$

where A_(i) ^(e)(t) is the number of circuits occupied by calls generated during the i^(th) interval after the end of the i^(th) interval.
 4. Method as claimed in claim 3, characterised in that A_(j) ^(s)(t) and A_(i) ^(e)(t) are given as: ${A_{j}^{s}(t)} = {I_{j}{H_{j}\left( {1 - ^{- \quad \frac{t}{H_{j}}}} \right)}}$ $A_{j}^{e} = {G_{j}^{- \frac{t}{H_{j}}}}$


5. Use of the method claimed in any of the claims 1-4 in a network management-performance management tool.
 6. Use of the method claimed in any of the claims 1-4 in a statistical module of a network element.
 7. Use of the method claimed in any of the claims 1-4 in an external module attached to a network element for supplying statistical data.
 8. Use of the method claimed in any of the claims 1-4 in a network planning and design tool.
 9. Arrangement for measuring holding time in a communications network, in which the network includes several network elements, each network element includes means for measuring the traffic volume in said element, by counting the number of circuits occupied by calls in a measurement interval, each network element further includes means for measuring the call intensity in said element, by counting the number of call attempts in the measurement interval, and means for computing the holding time in said network element, characterised in that the arrangement is adapted to store said traffic measurements from said measurement interval in a memory, repeat the traffic measurements during subsequent intervals, and compute the holding time for a given interval from traffic measurements in the given interval and traffic measurements from a number of previous intervals and measurements of call intensity in the given interval.
 10. Arrangement as claimed in claim 9, characterised in that the computing means is adapted to calculate the holding time, H_(j), for a given interval, j, from the relationship: H _(j)=({overscore (A _(j))}−{overscore (R _(j))})/I _(j) where {overscore (A_(j))}={overscore (G_(j))}+{overscore (R_(j))} is the average value of the traffic measured during the j^(th) interval, {overscore (G_(j))} is the call intensity during the j^(th) interval, ${\overset{\_}{G_{j}} = {\frac{1}{T}{\int_{0}^{T}{{A_{j}^{s}(t)}\quad {t}}}}},$

where A_(j) ^(s)(t) is the number of circuits occupied by calls generated during the j^(th) interval, {overscore (R_(j))} is the average value of the traffic remaining from earlier intervals, I_(j) is the call intensity measured as the number of call attempts counted during the j^(th) interval.
 11. Arrangement as claimed in claim 10, characterised in that said computing means are adapted to compute {overscore (R_(j))} as $\overset{\_}{R_{j}} = {\sum\limits_{i = {j - 1}}^{- \infty}\quad \overset{\_}{R_{i,j}}}$

where {overscore (R_(i,j))} is the average traffic from the i^(th) interval remaining in the j^(th) interval, and $\overset{\_}{R_{i,j}} = {\frac{1}{T}{\int_{{({j - i - 1})}T}^{{({j - i})}T}{{A_{i}^{e}(t)}\quad {t}}}}$

where A_(i) ^(e)(t) is the number of circuits occupied by calls generated during the i^(th) interval after the end of the i^(th) interval. 